A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
نویسندگان
چکیده
منابع مشابه
Bound constrained quadratic programming via piecewise quadratic functions
We consider the strictly convex quadratic programming problem with bounded variables. A dual problem is derived using Lagrange duality. The dual problem is the minimization of an unconstrained, piecewise quadratic function. It involves a lower bound of λ1, the smallest eigenvalue of a symmetric, positive definite matrix, and is solved by Newton iteration with line search. The paper describes th...
متن کاملA Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
We consider optimization problems with objective and constraint functions that may be nonconvex and nonsmooth. Problems of this type arise in important applications, many having solutions at points of nondifferentiability of the problem functions. We present a line search algorithm for situations when the objective and constraint functions are locally Lipschitz and continuously differentiable o...
متن کاملA finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
Existing global optimization techniques for nonconvex quadratic programming (QP) branch by recursively partitioning the convex feasible set and thus generate an infinite number of branch-and-bound nodes. An open question of theoretical interest is how to develop a finite branch-and-bound algorithm for nonconvex QP. One idea, which guarantees a finite number of branching decisions, is to enforce...
متن کاملAn improved lower bound and approximation algorithm for binary constrained quadratic programming problem
This paper presents an improved lower bound and an approximation algorithm based on spectral decomposition for the binary constrained quadratic programming problem. To decompose spectrally the quadratic matrix in the objective function, we construct a low rank problem that provides a lower bound. Then an approximation algorithm for the binary quadratic programming problem together with a worst ...
متن کاملBoxcqp: an Algorithm for Bound Constrained Convex Quadratic Problems
A quadratic programming problem with positive definite Hessian and bound constraints is solved, using a Lagrange multiplier approach. The proposed method falls in the category of exterior point, active set techniques. An iteration of our algorithm modifies both the minimization parameters in the primal space and the Lagrange multipliers in the dual space. Comparative results of numerical experi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1998
ISSN: 1052-6234,1095-7189
DOI: 10.1137/s1052623495297820